A Reduction Result for Planar Location Problemswith Polygonal
نویسنده
چکیده
In this paper we consider the problem of locating one new facility in the plane with respect to a given set of existing facilities where a set of polygonal barriers restricts traveling. This non-convex optimization problem can be reduced to a nite set of convex subproblems if the objective function is a convex function of the travel distances between the new and the existing facilities (like e.g. the Median and Center objective functions). An exact Algorithm and a heuristic solution procedure based on this reduction result are developed.
منابع مشابه
Nearly Optimal Expected-Case Planar Point Location
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision the probability that a query point lies within this polygon. The goal is to compute a search structure to determine which cell of the subdivision contains a given query point, so as to minimize the expected search time....
متن کاملSensorless parts orienting with a one-joint manipulator
This paper explores a sensorless technique for orienting planar parts. We follow an approach described in earlier papers [3, 4] called 1JOC for One Joint Over Conveyor, which can perform planar manipulation using a single controlled joint in combination with a constant-velocity conveyor. Our previous work demonstrated that the 1JOC approach can orient and feed planar polygonal parts, given a si...
متن کاملThe Complexity of Drawing a Graph in a Polygonal Region
We prove that the following problem is complete for the existential theory of the reals: Given a planar graph and a polygonal region, with some vertices of the graph assigned to points on the boundary of the region, place the remaining vertices to create a planar straight-line drawing of the graph inside the region. This strengthens an NP-hardness result by Patrignani on extending partial plana...
متن کاملTOPOLOGY OPTIMIZATION OF 2D BUILDING FRAMES UNDER ARTIFICIAL EARTHQUAKE GROUND MOTIONS USING POLYGONAL FINITE ELEMENT METHOD
In this article, topology optimization of two-dimensional (2D) building frames subjected to seismic loading is performed using the polygonal finite element method. Artificial ground motion accelerograms compatible with the design response spectrum of ASCE 7-16 are generated for the response history dynamic analysis needed in the optimization. The mean compliance of structure is minimized as a t...
متن کاملPlanar and SPECT Monte Carlo acceleration using a variance reduction technique in I131 imaging
Background: Various variance reduction techniques such as forced detection (FD) have been implemented in Monte Carlo (MC) simulation of nuclear medicine in an effort to decrease the simulation time while keeping accuracy. However most of these techniques still result in very long MC simulation times for being implemented into routine use. Materials and Methods: Convolution-based force...
متن کامل